Models of random graph hierarchies
نویسندگان
چکیده
We introduce two models of inclusion hierarchies: Random Graph Hierarchy (RGH) and Limited Random Graph Hierarchy (LRGH). In both models a set of nodes at a given hierarchy level is connected randomly, as in the Erdős-Rényi random graph, with a fixed average degree equal to a system parameter c. Clusters of the resulting network are treated as nodes at the next hierarchy level and they are connected again at this level and so on, until the process cannot continue. In the RGH model we use all clusters, including those of size 1, when building the next hierarchy level, while in the LRGH model clusters of size 1 stop participating in further steps. We find that in both models the number of nodes at a given hierarchy level h decreases approximately exponentially with h. The height of the hierarchy H , i.e. the number of all hierarchy levels, increases logarithmically with the system size N , i.e. with the number of nodes at the first level. The height H decreases monotonically with the connectivity parameter c in the RGH model and it reaches a maximum for a certain cmax in the LRGH model. The distribution of separate cluster sizes in the LRGH model is a power law with an exponent about −1.25. The above results follow from approximate analytical calculations and have been confirmed by numerical simulations. PACS. 89.75.-k Complex systems
منابع مشابه
Derrida’s Generalised Random Energy models 1: models with finitely many hierarchies
This is the first of a series of three papers in which we present a full rigorous analysis of a class of spin glass models introduces by Derrida under the name of Generalised Random Energy Models (GREM). They are based on Gaussian random processes on the hypercube {−1,1}N with a hierarchical correlation structure. In this first paper we analyse the models with a finite number of hierarchies. In...
متن کاملProbabilistic Models in Cluster Analysis
This paper discusses cluster analysis in a probabilistic and inferential framework as opposed to more exploratory, heuristic or algorithmic approaches. It presents a broad survey on probabilistic models for partitiontype, hierarchical and tree-like clustering structures and points to the relevant literature. It is shown how suitable clustering criteria or grouping methods may be derived from th...
متن کاملOn the Complexity of Contraction Hierarchies
Contraction Hierarchies are an experimentally well studied method to efficiently handle point-topoint shortest-path queries in large graphs. In a preprocessing stage the vertices of the input graph are iteratively removed, while the shortest-path structure of the remaining graph is preserved. This results in a hierarchy of graphs and shortest-path queries can be answered by only considering edg...
متن کاملSecure Communication in Shotgun Cellular Systems
In this paper, we analyze the secure connectivity in Shotgun cellular systems (SCS: Wireless communication systems with randomly placed base stations) by Poisson intrinsically secure communication graph (IS-graph), i.e., a random graph which describes the connections that are secure over a network. For a base-station in SCS, a degree of secure connections is determined over two channel models: ...
متن کاملStructural Inference of Hierarchies in Networks
One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to form groups of groups, and so forth, up through all levels of organization in the network. Here, we give a precise definition of hierarchical structure, give a generic model for generating arbitrary hierarchical structu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1505.00985 شماره
صفحات -
تاریخ انتشار 2015